Guaranteeing Safe Destructive Updates Through a Type System with Uniqueness Information for Graphs
نویسندگان
چکیده
In this paper we present a type system for graph rewrite systems uniqueness typing It employs usage information to deduce whether an object is unique at a certain moment i e is only locally accessible In a type of a function it can be speci ed that the function requires a unique argument object The correctness of type assignment guarantees that no external access on the original object will take place in the future The presented type system is proven to be correct We illustrate the power of the system by de ning an elegant quicksort algorithm that performs the sorting in situ on the data structure
منابع مشابه
Capabilities for Uniqueness and Borrowing
An important application of unique object references is safe and efficient message passing in concurrent object-oriented programming. However, to prevent the ill effects of aliasing, practical systems often severely restrict the shape of messages passed by reference. Moreover, the problematic interplay between destructive reads–often used to implement unique references–and temporary aliasing th...
متن کاملExistence and uniqueness of the solution for a general system of operator equations in $b-$metric spaces endowed with a graph
The purpose of this paper is to present some coupled fixed point results on a metric space endowed with two $b$-metrics. We shall apply a fixed point theorem for an appropriate operator on the Cartesian product of the given spaces endowed with directed graphs. Data dependence, well-posedness and Ulam-Hyers stability are also studied. The results obtained here will be applied to prove the existe...
متن کاملStatic Analysis for Safe Destructive Updates in a Functional Language
Functional programs are more amenable to rigorous mathematical analysis than imperative programs, but are typically less efficient in terms of execution space and time. The update of aggregate data structures, such as arrays, are a significant source of space/time inefficiencies in functional programming. Imperative programs can execute such updates in place, whereas the semantics of functional...
متن کاملInteractive Functional Objects in Clean
The functional programming language Clean has a high level I/O system (version 0.8) in which complex yet eecient interactive programs can be created. In this paper we present its successor (version 1.0), the object I/O system. We consider some of the design considerations that have innuenced the design of the new I/O system greatly. Key issues are compositionality, orthogonality, and extensibil...
متن کاملConventional and Uniqueness Typing in Graph Rewrite Systems
In this paper we describe a Curry-like type system for graphs and extend it with uniqueness information to indicate that certain objects are onlyìocally accessible'. The correctness of type assignment guarantees that no external access on such an object will take place in the future. We prove that types are preserved under reduction (for both type systems) for a large class of rewrite systems. ...
متن کامل